Contraction distance between isomorphism classes of graphs
نویسندگان
چکیده
منابع مشابه
On Distances between Isomorphism Classes of Graphs
Various measures of distance between (the isomorphism classes of) two graphs have been proposed. These include measures proposed by Zelinka [6],[7], Baláž, Koča, Kvasńıčka & Sekanina [1] and Johnson [4]. Further, there is the edge rotation distance of Chartrand, Saba & Zou [3] and the edge shift distance of Johnson [5]. It is on the latter two that we build. For terminology and notation not exp...
متن کاملIsomorphism classes of cycle permutation graphs
Kwak, J.H. and J. Lee, Isomorphism classes of cycle permutation graphs, Discrete Mathematics 105 (1992) 131-142. In this paper, we construct a cycle permutation graph as a covering graph over the dumbbell graph, and give a new characterization of when two given cycle permutation graphs are isomorphic by a positive or a negative natural isomorphism. Also, we count the isomorphism classes of cycl...
متن کاملGraph Classes between Parity and Distance-Hereditary Graphs
Several graph problems (e.g., steiner tree, connected domination, hamiltonian path, and isomorphism problem), which can be solved in polynomial time for distance-hereditary graphs, are NP-complete or open for parity graphs. Moreover, the metric characterizations of these two graph classes suggest an excessive gap between them. We introduce a family of classes forming an infinite lattice with re...
متن کاملMeasurement Isomorphism of Graphs
The d-measurement set of a graph is its set of possible squared edge lengths over all d-dimensional embeddings. In this note, we define a new notion of graph isomorphism called d-measurement isomorphism. Two graphs are d-measurement isomorphic if there is agreement in their d-measurement sets. A natural question to ask is “what can be said about two graphs that are d-measurement isomorphic?” In...
متن کاملOn the distance eigenvalues of Cayley graphs
In this paper, we determine the distance matrix and its characteristic polynomial of a Cayley graph over a group G in terms of irreducible representations of G. We give exact formulas for n-prisms, hexagonal torus network and cubic Cayley graphs over abelian groups. We construct an innite family of distance integral Cayley graphs. Also we prove that a nite abelian group G admits a connected...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Časopis pro pěstování matematiky
سال: 1990
ISSN: 0528-2195
DOI: 10.21136/cpm.1990.108363